Contracting planar graphs to contractions of triangulations
نویسندگان
چکیده
Article history: Received 12 December 2010 Received in revised form 24 February 2011 Accepted 7 March 2011 Available online 15 March 2011
منابع مشابه
On random planar graphs, the number of planar graphs and their triangulations
Let P n be the set of labelled planar graphs with n vertices. Denise, Vasconcellos and Welsh proved that jP n j n! 75:8 n+o(n) and Bender, Gao and Wormald proved that jP n j n! 26:1 n+o(n). McDiarmid proved that almost all graphs in P n have at least 13=7n edges. In this paper, we show that jP n j n! 37:3 n+o(n) and that almost all graphs in P n have at most 2:56n edges. The proof relies on a r...
متن کاملTriangle Graphs
We introduce a new class of planar graphs called triangle graphs. First, we present a formal way of constructing and characterizing triangle graphs, and then show that they characterize the adjacencies of arbitrary triangulations and they are three-colorable for a certain subclass of triangulations. Subsequently, we discuss an application of triangle graphs to the parallel nite element solution...
متن کاملCounting Triangulations of Planar Point Sets
We study the maximal number of triangulations that a planar set of n points can have, and show that it is at most 30n. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has led to the previous best upper bound of 43n for the problem. Moreover, this new bound is useful for bounding the number of other types of planar (i.e., crossing-fre...
متن کاملSuccinct representations of planar maps
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the focus is here on designing data structures that preserve the possibility of answering incidence queries in constant time. We propose in particular the first optimal representations for 3-connected planar graphs and trian...
متن کاملTriangulations and the Hajós Conjecture
The Hajós Conjecture was disproved in 1979 by Catlin. Recently, Thomassen showed that there are many ways that Hajós conjecture can go wrong. On the other hand, he observed that locally planar graphs and triangulations of the projective plane and the torus satisfy Hajós Conjecture, and he conjectured that the same holds for arbitrary triangulations of closed surfaces. In this note we disprove t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Discrete Algorithms
دوره 9 شماره
صفحات -
تاریخ انتشار 2011